898A - Rounding - CodeForces Solution


implementation math *800

Please click on ads to support us..

Python Code:

n = int(input())
if n % 10 <= 5:
    print(n - n % 10)
else:
    print(n + 10 - n % 10)

C++ Code:

#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;

#define ll long long

ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return (b / gcd(a, b)) * a; }

void Candidate_Elde7k() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
}

int main() {
	Candidate_Elde7k();
	int n; cin >> n;
	if (n % 10 == 0) {
		cout << n << "\n";
	}
	else if (n < 10) {
		if (n >= 5) {
			cout << 10 << "\n";
		}
		else{
			cout << 0 << "\n";
		}
	}
	else {
		if (n % 10 < 5) {
			cout << n / 10 << 0 << "\n";
		}
		else {
			n /= 10;
			n++;
			cout << n << 0 << "\n";	
		}
	}
}


Comments

Submit
0 Comments
More Questions

145. Binary Tree Postorder Traversal
94. Binary Tree Inorder Traversal
101. Symmetric Tree
77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians